/*
 * 	Author : Pallab
 * 	Prog: G.cxx
 *
 * 	Created on: 02:36:22 PM - 2013:3:3
 * "I have not failed, I have just found 10000 ways that won't work."
 */
#include <iostream>
#include <algorithm>
#include <vector>
#include <sstream>
#include <fstream>
#include <string>
#include <list>
#include <map>
#include <set>
#include <queue>
#include <deque>
#include <numeric>
#include <stack>
#include <functional>
#include <bitset>
#include <iomanip>

#include <ctime>
#include <cassert>
#include <cstdio>
#include <cmath>
#include <cstring>
#include <climits>
#include <cstring>
#include <cstdlib>

using namespace std;


#define foR(i,frm,upto) for( int i=(frm),_i=(upto);(i) < (_i) ; ++i )
#define foD(i,frm,upto) for( int i=(frm),_i=(upto);(i) >= (_i) ; --i )
#define foit(i, x) for (typeof((x).begin()) i = (x).begin(); i != (x).end(); i++)
#define Int long long
#define pb push_back
#define SZ(X) (int)(X).size()
#define LN(X) (int)(X).length()
#define mk make_pair
#define dbg(...)       printf(__VA_ARGS__)
#define SET( ARRAY , VALUE ) memset( ARRAY , VALUE , sizeof(ARRAY) )
#define line puts("")

inline void wait ( double seconds ) {
    double endtime = clock() + ( seconds * CLOCKS_PER_SEC );
    while ( clock() < endtime ) {
        ;
    }
}
template<class T>
    inline T fastIn() {
    register char c=0;
    register T a=0;
    bool neg=false;
    while ( c<33 ) c=getchar();
    while ( c>33 ) {
        if ( c=='-' ) {
            neg=true;
        } else {
            a= ( a*10 ) + ( c-'0' );
        }
        c=getchar();
    }
    return neg?-a:a;
}
int const mxn = 50010;
int ki[mxn];
int ski[mxn];
int n,k,queryCount;
inline void read() {
    n=fastIn<int>(),k=fastIn<int>(),queryCount=fastIn<int>();
    foR ( i,0,k ) {
        ski[i]=ki[i]=fastIn<int>();
    }
    sort ( ski,ski+k,less<int>() );
}
inline int lessEqual(int number){
    int lo=0,hi=k,bst=lo;
    while(lo+1<hi){
        int mid=(lo+hi)/2;
        if( ski[mid]<=number ){
            lo=mid;
            bst=max(bst,lo);
        }else{
            hi=mid;
        }
    }
    return bst;
}
inline void proc() {
    foR ( i,0,queryCount ) {
        int number=fastIn<int>(),newNumber,tmpNumber;
        if ( number<=k ) {
            cout<<ki[number-1]<<'\n';
        } else {
            tmpNumber=number = number-k;
            while ( 1 ) {
                int cnt = lessEqual ( tmpNumber );
                newNumber = number+cnt+1;
                int tmp = lessEqual ( newNumber );
                if ( cnt==tmp ) {
                    cout<<newNumber<<'\n';
                    break;
                }
                tmpNumber=newNumber;
            }
        }
    }
}
int main() {
    int kase = 1;
#if defined( xerxes_pc )
    if ( !freopen ( "in1", "r", stdin ) )
        puts ( "error opening file in " ), assert ( 0 );
    kase = 1;
#endif
    kase=fastIn<int>();
    foR ( i,0,kase ) {
        read();
        cout<<"Case "<<i+1<<":\n";
        proc();
    }
    return 0;
}
// kate: indent-mode cstyle; indent-width 4; replace-tabs on; 

